package modele;

public interface Automata {
	/**
	 * Run throught the AFN to find a way from an initial state to a final state
	 * with a given word. Test with all initial states.
	 * 
	 * @param word a string to test
	 * @return true if the word is accepted, if not, false
	 */
	public boolean accept(String word);

	/**
	 * Check if the AFN contains states.
	 * 
	 * @return true if the AFN does not contains states
	 */
	public boolean isEmpty();

	/**
	 * Convert the current AFN to deterministic one and return it. (Not
	 * implemented)
	 * 
	 * @return the deterministicized this
	 */
	public AFN deterministic();
}
